A spanning set for VOA modules

Colored Spanning Graphs for Set Visualization

We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the blue set, red points belong exclusively to the red set, and purple points belong to both sets. A red-blue-purple spanning graph (RBP spanning graph) is a set of edges connecting...

Intertwining operators for VOA and their applications

1.1 Notation In this note, N denotes the set of non-negative integers, i.e. N = {0, 1, 2, . . . }. Let V be a C-linear space and z a formal variable. We introduce the following linear spaces: V [z] := {n∈N vnz | vn ∈ V, vn = 0 for all but finitely many n}, V [z, z−1] := {n∈Z vnz | vn ∈ V, vn = 0 for all but finitely many n}, V [[z]] := {n∈N vnz | vn ∈ V }, V [[z, z−1]] := {n∈Z vnz | vn ∈ V }, V...

Related Work : Color - Spanning Set

Set Families and Foulkes Modules

We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label the irreducible characters appearing as summands of the characters of Foulkes modules. The homomorphisms are defined using certain families of subsets of the na...

Hierarchical Minimum Spanning Trees for Lossy Image Set Compression

A number of minimum spanning tree algorithms have been proposed for lossy compression of image sets. In these algorithms, a complete graph is constructed from the entire image set and possibly an average image, and a minimum spanning tree is used to determine which difference images to encode. In this paper, we propose a hierarchical minimum spanning tree algorithm in which the minimum spanning...